Equivalence of Quasi-cyclic Codes over Finite Fields
نویسندگان
چکیده
This paper considers the equivalence problem for quasi-cyclic codes over finite fields. The results obtained are used to construct isodual quasi-cyclic codes.
منابع مشابه
The Permutation Groups and the Equivalence of Cyclic and Quasi-Cyclic Codes
We give the class of finite groups which arise as the permutation groups of cyclic codes over finite fields. Furthermore, we extend the results of Brand and Huffman et al. and we find the properties of the set of permutations by which two cyclic codes of length p can be equivalent. We also find the set of permutations by which two quasi-cyclic codes can be equivalent.
متن کاملOn the equivalence of cyclic and quasi-cyclic codes over finite fields
This paper studies the equivalence problem for cyclic codes of length p and quasi-cyclic codes of length pl. In particular, we generalize the results of Huffman, Job, and Pless (J. Combin. Theory. A, 62, 183–215, 1993), who considered the special case p. This is achieved by explicitly giving the permutations by which two cyclic codes of prime power length are equivalent. This allows us to obtai...
متن کاملSkew Generalized Quasi-Cyclic Codes Over Finite Fields
In this work, we study a class of generalized quasi-cyclic (GQC) codes called skew GQC codes. By the factorization theory of ideals, we give the Chinese Remainder Theorem over the skew polynomial ring, which leads to a canonical decomposition of skew GQC codes. We also focus on some characteristics of skew GQC codes in details. For a 1-generator skew GQC code, we define the parity-check polynom...
متن کاملQuasi-cyclic codes as codes over rings of matrices
Quasi cyclic codes over a finite field are viewed as cyclic codes over a non commutative ring of matrices over a finite field. This point of view permits to generalize some known results about linear recurring sequences and to propose a new construction of some quasi cyclic codes and self dual codes.
متن کاملOn Isodual Cyclic Codes over Finite Fields and Finite Chain Rings: Monomial Equivalence
This paper present the construction cyclic isodual codes over finite fields and finite chain rings. These codes are monomially equivalent to their dual. Conditions are given for the existence of cyclic isodual codes. In addition, the concept of duadic codes over finite fields is extended to finite chain rings. Several constructions of isodual cyclic codes and self-dual codes are given.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- CoRR
دوره abs/1607.07798 شماره
صفحات -
تاریخ انتشار 2016